#include"BT.h"
#include"Queue.h"
int main()
{
	BTNode* a = creat(1);
	BTNode* b = creat(2);
	BTNode* c = creat(3);
	BTNode* d = creat(4);
	BTNode* e = creat(5);
	BTNode* f = creat(6);
	BTNode* g = creat(3);
	a->left = b;
	a->right = c;
	b->left = e;
	b->right = f;
	c->right = g;
	printf("%d\n", BinaryTreeLeafSize(a));
	printf("%d\n", BinaryTreeDeep(a));
	printf("%d\n", BinaryTreeLevelKSize(a,2));
	printf("%d\n", BinaryTreeComplete(a));
	return 0;
}    
